#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if(nums.empty()){
            return 0;
        }
        int low = 0;
        int fast = 1;
        int maxValue = 1;
        while(fast<nums.size()){
            if(nums[fast]>nums[fast-1]){
                ++fast;                
            }
            else{
                maxValue = max(maxValue,fast-low);
                low = fast;
                fast = fast+1;
            }
        }
        return max(maxValue,fast-low);

    }
};

int main(){
    Solution S;
    vector<int> nums = {1,3,5,7};
    cout<<S.findLengthOfLCIS(nums)<<endl;
}